Independent spanning trees of chordal rings
نویسندگان
چکیده
منابع مشابه
Independent Spanning Trees of Extended Chordal Rings
A graphG = (V,E) is called a chordal ring and denoted by CR(N, d), if V = {0, 1, · · · , N− 1} and E = {(u, v) | [v − u]N = 1 or [v − u]N = d, 2 ≦ d ≦ N/2)}, where [v − u]N denotes v − u modulo N . A graph G = (V,E) is called an extended chordal ring and denoted by CR(N, d1, d2), if V = {0, 1, · · · , N − 1} and E = {(u, v) | [v − u]N = 1 or [v − u]N = di, 1 ≦ i ≦ 2, 2 ≦ di ≦ N/2)}. CR(N, d1, N...
متن کاملDominator Tree Certification and Independent Spanning Trees
How does one verify that the output of a complicated program is correct? One can formally prove that the program is correct, but this may be beyond the power of existing methods. Alternatively one can check that the output produced for a particular input satisfies the desired input-output relation, by running a checker on the input-output pair. Then one only needs to prove the correctness of th...
متن کاملTwo counterexamples on completely independent spanning trees
For each k ≥ 2, we construct a k-connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example for a 3-connected maximal plane graph not containing two completely independent spanning trees.
متن کاملOn Constructing Three Edge Independent Spanning Trees
Abstract. In this paper, we show that a prior result by Khuller and Schieber on the construction of k edge independent spanning trees in a k edge-connected graph fails under certain scenarios. We illustrate the failing of the algorithm with an example and identify the cause, which we refer to as the partial order inversion. For the case of k = 3, we develop a method to compute three edge indepe...
متن کاملNode-Independent Spanning Trees in Gaussian Networks
Gaussian network is known to be an alternative to toroidal network since it has the same number of nodes with less diameter, which makes it perform better than toroidal network. Spanning trees are said to be independent if all trees are rooted at the same node r and for any other node u, the nodes of the paths from r to u in all trees are distinct except the nodes r and u. In this paper, we inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1999
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(98)00205-1